Modular classes revisited
نویسندگان
چکیده
منابع مشابه
Modular Classes of Loday Algebroids
We introduce the concept of Loday algebroids, a generalization of Courant algebroids. We define the naive cohomology and modular class of a Loday algebroid, and we show that the modular class of the double of a Lie bialgebroid vanishes. For Courant algebroids, we describe the relation between the naive and standard cohomologies and we conjecture that they are isomorphic when the Courant algebro...
متن کاملMultiple Internet Service Classes Revisited
It is debatable in the literature that whether the provision of multiple Internet service classes is economically viable. In this work a critical study is undertaken for a general model that considers a continuum of users using heterogeneous congestible service classes, under a class of general concave congestion functions and an arbitrary distribution of user preferences. We show that there is...
متن کاملThe Montgomery Modular Inverse-Revisited
We modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the KaliskiMontgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for software implementations on general-purpose m...
متن کاملModular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually dependent input provided by other modules. Moreover, (mutually) recursive module calls are allo...
متن کاملModular Semantics and Logics of Classes
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which method closures are held together with field values. Such a store is also called “higher-order” and does not come for free [13]. It is much harder to prove properties of such stores and as a consequence (soundness of) p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Geometric Methods in Modern Physics
سال: 2014
ISSN: 0219-8878,1793-6977
DOI: 10.1142/s0219887814600421